Stress constrained $G$ closure and relaxation of structural design problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achieving Design Closure Through Delay Relaxation Parameter

Current design automation methodologies are becoming incapable of achieving design closure especially in the presence of deep submicron effects. This paper addresses the issue of design closure from a high level point of view. A new metric called delay relaxation parameter (DRP) for RTL designs is proposed. DRP essentially captures the degree of delay relaxation that the design can tolerate wit...

متن کامل

A semidefinite relaxation scheme for quadratically constrained

  Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...

متن کامل

Service-Constrained Network Design Problems

Several practical instances of network design problems often require the network to satisfy multiple constraints. In this paper, we focus on the following problem (and its variants): nd a low-cost network, under one cost function, that services every node in the graph, under another cost function, (i.e., every node of the graph is within a prespeciied distance from the network). This study has ...

متن کامل

Lagrangian relaxation and enumeration for solving constrained shortest-path problems

The constrained shortest-path problem (CSPP) generalizes the standard shortest-path problem by adding one or more path-weight side constraints. We present a new algorithm for CSPP that Lagrangianizes those constraints, optimizes the resulting Lagrangian function, identifies a feasible solution, and then closes any optimality gap by enumerating nearshortest paths, measured with respect to the La...

متن کامل

Resolving Over-Constrained Probabilistic Temporal Problems through Chance Constraint Relaxation

When scheduling tasks for field-deployable systems, our solutions must be robust to the uncertainty inherent in the real world. Although human intuition is trusted to balance reward and risk, humans perform poorly in risk assessment at the scale and complexity of real world problems. In this paper, we present a decision aid system that helps human operators diagnose the source of risk and manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 2004

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/2054601